Exact and heuristic solution approaches for the airport gate assignment problem

In this study, we consider an airport gate assignment problem that assigns a set of aircraft to gates. The cannot be assigned any are directed apron. We aim make aircraft-gate assignments so as minimize the number apron and among usage minimizing solutions, total walking distance travelled by all passengers. is formulated mixed-integer nonlinear programming model then it linearized. A branch bound algorithm, beam search filtered algorithms employ powerful lower upper bounding mechanisms developed. results computational experiment have shown satisfactory performance algorithms.